On computation of the steady-state probability distribution of probabilistic Boolean networks with gene perturbation
نویسندگان
چکیده
منابع مشابه
GPU-Accelerated Steady-State Computation of Large Probabilistic Boolean Networks
Computation of steady-state probabilities is an important aspect of analysing biological systems modelled as probabilistic Boolean networks (PBNs). For small PBNs, efficient numerical methods can be successfully applied to perform the computation with the use of Markov chain state transition matrix underlying the studied networks. However, for large PBNs, numerical methods suffer from the state...
متن کاملAn approximation method for solving the steady-state probability distribution of probabilistic Boolean networks
MOTIVATION Probabilistic Boolean networks (PBNs) have been proposed to model genetic regulatory interactions. The steady-state probability distribution of a PBN gives important information about the captured genetic network. The computation of the steady-state probability distribution usually includes construction of the transition probability matrix and computation of the steady-state probabil...
متن کاملSteady-state probabilities for attractors in probabilistic Boolean networks
Boolean networks form a class of disordered dynamical systems that have been studied in physics owing to their relationships with disordered systems in statistical mechanics and in biology as models of genetic regulatory networks. Recently they have been generalized to probabilistic Boolean networks (PBNs) to facilitate the incorporation of uncertainty in the model and to represent cellular con...
متن کاملGene perturbation and intervention in probabilistic Boolean networks.
MOTIVATION A major objective of gene regulatory network modeling, in addition to gaining a deeper understanding of genetic regulation and control, is the development of computational tools for the identification and discovery of potential targets for therapeutic intervention in diseases such as cancer. We consider the general question of the potential effect of individual genes on the global dy...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2012.02.022